Recurrence relations for the midpoint method
نویسندگان
چکیده
منابع مشابه
Stability of the leapfrog/midpoint method
The leapfrog method is popular because of its good stability when solving partial differential equations with oscillatory solutions. “It has the disadvantage that the solution at odd time steps tends to drift farther and farther from the solution for even time steps, so it is common to stop the integration every twenty time steps or so and reinitialize with the first order forward Euler method ...
متن کاملThe midpoint method for parallelization of particle simulations.
The evaluation of interactions between nearby particles constitutes the majority of the computational workload involved in classical molecular dynamics (MD) simulations. In this paper, we introduce a new method for the parallelization of range-limited particle interactions that proves particularly suitable to MD applications. Because it applies not only to pairwise interactions but also to inte...
متن کامل( Probabilistic ) Recurrence Relations
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x) = a(x)+T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x. Then T(x) is a random variable, whose distribution depends on the distribution of H(x). To give high proba...
متن کاملRecurrence Relations for Quotient Moment of Generalized Pareto Distribution Based on Generalized Order Statistics and Characterization
Generalized Pareto distribution play an important role in reliability, extreme value theory, and other branches of applied probability and statistics. This family of distributions includes exponential distribution, Pareto distribution, and Power distribution. In this paper, we established exact expressions and recurrence relations satisfied by the quotient moments of generalized order statistic...
متن کاملRECURRENCE RELATIONS , FRACTALS , AND CHAOS 1 Recurrence Relations , Fractals , and Chaos : Implications for Analyzing Gene Structure
The " chaos game " is a well-known algorithm by which one may construct a pictorial representation of an iterative process. The resulting sets are known as fractals and can be mathematically characterized by measures of dimension as well as by their associated recurrence relations. Using the chaos game algorithm, is it possible to derive meaningful structure out of our own genetic encoding, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tamkang Journal of Mathematics
سال: 2000
ISSN: 2073-9826,0049-2930
DOI: 10.5556/j.tkjm.31.2000.412